ARC037 B - バウムテスト

提出

code: python

n, m = map(int, input().split())

graph = [[] for _ in range(n+1)]

for i in uv:

# 閉路が含まれる -> 3つ以上で循環

# 循環している ->

for i in graph:

for j in i:

解答

code: python

from collections import deque

n, m = list(map(int, input().split()))

U = []

V = []

for u, v in uv:

u -= 1

v -= 1

U.append(u)

V.append(v)

# print(U)

# print(V)

ans = 0

visited = set()

def dfs(i):

que = deque()

que.append(i)

flag = True

while que:

now = que.pop()

if now in visited: # 探索済み頂点をpopしたら閉路

flag = False

else:

visited.add(now)

for j in range(m):

# つながっていて未探索の頂点ならpush

# 頂点iからの探索を終えたとき閉路があるかを返す

return flag

for l in range(n):

if l not in visited:

if dfs(l):

ans += 1

print(ans)

code: python

from collections import defaultdict

from collections import deque

n, m = list(map(int, input().split()))

d = defaultdict(list)

for u, v in uv:

# print(d)

ans = 0

visited = set()

def dfs(i):

que = deque()

que.append(i)

flag = True

while que:

now = que.pop()

if now in visited: # 探索済み頂点をpopしたら閉路

flag = False

else:

visited.add(now)

if n not in visited:

que.append(n)

# 頂点iからの探索を終えたとき閉路があるかを返す

return flag

for l in range(1, n+1):

if l not in visited:

if dfs(l):

ans += 1

print(ans)

テーマ

メモ

提出

code: python

from collections import defaultdict

from collections import deque

n, m = list(map(int, input().split()))

d = defaultdict(list)

for u, v in uv:

# print(d)

visited = set()

q = deque()

while q:

now = q.popleft()

for i in now:

if i in visited:

continue

else:

visited.add(i)

print(visited)